A Wait-free Algorithm for Optimistic Programming: HOPE Realized
نویسندگان
چکیده
Optimism is a powerful technique for avoiding latency by increasing concurrency. Optimistically assuming the results of one computation allows other computations to execute in parallel, even when they depend on the assumed result. Optimistic techniques can particularly benefit distributed systems because of the critical impact of communications latency. This paper reviews HOPE: our model of optimistic programming, and describes how optimism can enhance distributed program performance by avoiding remote communications delay. We then present the wait-free algorithm used to implement HOPE in a distributed environment.
منابع مشابه
Optimistic replication in HOPE
The growing imbalance between network latency and throughput is causing nodes in distributed systems to appear to be moving farther apart. Many distributed systems are turning to replication as a mechanism to make resources appear closer. However, maintaining one-copy consistency in a system containing replicated elements has proven diicult. In particular, the checks required to make consistent...
متن کاملSimplified synchronization through optimistic linearizability
We explore a novel programming model for multicore architectures in which shared data-structures are replicated per-thread. With a suitable mechanism for broadcasting data-structure operations (which may be wait-free or lock-free) there is no longer a need for elaborate, datastructure-specific synchronization (e.g. as seen in java.util.concurrent) at each replica. Moreover, threads can lazily a...
متن کاملOptimistic Programming in PVM
Optimism is a powerful technique for increasing concurrency. A program can gain concurrency by making an optimistic assumption about its future state, and verifying the assumption in parallel with computations based on the optimistic assumption. To date, use of optimism has been restricted to specialized systems due to the diiculty of writing optimistic programs. In this paper, we deene and jus...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملA Lazy Concurrent List-Based Set Algorithm
List-based implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lock-free list-based set algorithm of Michael will be included in the Java Concurrency Package of JDK 1.6.0. However, Michael’s lock-free algorithm has several drawbacks, most notably that it requires all list traversal operations, including membership tests, to perform cle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996